منابع مشابه
A half century of scalloping in the work habits of the United States Congress.
It has been suggested that the work environment of the United States Congress bears similarity to a fixed-interval reinforcement schedule. Consistent with this notion, Weisberg and Waldrop (1972) described a positively accelerating pattern in annual congressional bill production (selected years from 1947 to 1968) that is reminiscent of the scalloped response pattern often attributed to fixed-in...
متن کاملFixed-term work and violence at work.
OBJECTIVES This study investigated the effect of a fixed-term job contract on encounters of violence at work. We assumed that fixed-term employees encountered more violence or threats of violence at their work than permanent employees. METHODS This study is based on 3 large statistical data sets: (a) the Work and Health surveys carried out by the Finnish Institute of Occupational Health in 19...
متن کاملInterval censored regression with fixed effects
This paper considers estimation of a fixed-effects model with an interval-censored dependent variable. In each time period, the researcher observes the interval (with known endpoints) in which the dependent variable lies but not the value of the dependent variable itself. Two versions of the model are considered, a parametric model with logistic errors and a semiparametric model with errors hav...
متن کاملInterval Completion Is Fixed Parameter Tractable
We present an algorithm with runtime O(knm) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem ha...
متن کاملUnit Interval Editing is Fixed-Parameter Tractable
Given a graph G and integers k1, k2, and k3, the unit interval editing problem asks whether G can be transformed into a unit interval graph by at most k1 vertex deletions, k2 edge deletions, and k3 edge additions. We give an algorithm solving this problem in time 2 logk) · (n+m), where k := k1 +k2 +k3, and n,m denote respectively the numbers of vertices and edges of G. Therefore, it is fixed-pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Behavior Analysis
سال: 1972
ISSN: 0021-8855
DOI: 10.1901/jaba.1972.5-93